TIME AND SPACE COMPLEXITY OF INSIDE-OUT MACRO LANGUAGESASVELD PRJ.1981; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1981; VOL. 10; NO 1; PP. 3-14; BIBL. 24 REF.Article

SPACE-BOUNDED COMPLEXITY CLASSES AND ITERATED DETERMINISTIC SUBSTITUTIONASVELD PRJ.1980; INFORM. AND CONTROL; USA; DA. 1980; VOL. 44; NO 3; PP. 282-299; BIBL. 2 P.Article

CONTROLLED ITERATION GRAMMARS AND FULL HYPER-AFL'S.ASVELD PRJ.1977; INFORM. AND CONTROL; U.S.A.; DA. 1977; VOL. 34; NO 3; PP. 248-269; BIBL. 1 P. 1/2Article

COMPLEXITY THEORY AND THE OPERATIONAL STRUCTURE OF ALGEBRAIC PROGRAMMING SYSTEMSASVELD PRJ; TUCKER JV.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 17; NO 4; PP. 451-476; BIBL. 32 REF.Article

ITERATED DETERMINISTIC SUBSTITUTION.ASVELD PRJ; ENGELFRIET J.1977; ACTA INFORMAT.; ALLEM.; DA. 1977; VOL. 8; NO 3; PP. 285-302Article

A NOTE ON NON-GENERATORS OF FULL AFL'SASVELD PRJ; ENGELFRIET J.1982; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1982; VOL. 12; NO 1; PP. 13-17; BIBL. 6 REF.Article

EXTENDED LINEAR MACRO GRAMMARS, ITERATION GRAMMARS AND REGISTER PROGRAMSASVELD PRJ; ENGELFRIET J.1979; ACTA INFORMAT.; DEU; DA. 1979; VOL. 11; NO 3; PP. 259-285; BIBL. 28 REF.Article